PCol Automata: Recognizing Strings with P Colonies
نویسندگان
چکیده
1 Institute of Computer Science, Silesian University in Opava Bezručovo nám. 13, 74601 Opava, Czech Republic {ludek.cienciala,lucie.ciencialova}@fpf.slu.cz 2 Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17, 1111 Budapest, Hungary {csuhaj,vaszil}@sztaki.hu 3 Department of Algorithms and Their Applications Faculty of Informatics, Eötvös Loránd University Pázmány Péter sétány 1/c, 1117 Budapest, Hungary
منابع مشابه
An Application of the PCol Automata in Robot Control
The P colonies were introduced in [6] as a variant of the bio-inspired computational models called membrane systems or P systems. In [2] we divided agents into the groups according the function they provide; we introduced the modularity on the P colonies. PCol automata are an extension of the P colonies by the tape (see [1]). This is an accepting computational device based on the very simple co...
متن کاملImproved constructions of mixed state quantum automata
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states than deterministic finite automata recognizing the same language. There was an unpublished ‘‘folk th...
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملReal-Time Recognition of Cyclic Strings by One-Way and Two-Way Cellular Automata
This paper discusses real-time language recognition by 1dimensional one-way cellular automata (OCAs) and two-way cellular automata (CAs), focusing on limitations of the parallel computation power. To clarify the limitations, we investigate real-time recognition of cyclic strings of the form uk with u ∈ {0, 1}+ and k ≥ 2. We show a version of pumping lemma for recognizing cyclic strings by OCAs,...
متن کاملAutomata on Guarded Strings and Applications
Guarded strings are like ordinary strings over a finite alphabet P, except that atoms of the free Boolean algebra on a set of atomic tests B alternate with the symbols of P. The regular sets of guarded strings play the same role in Kleene algebra with tests as the regular sets of ordinary strings do in Kleene algebra. In this paper we develop the elementary theory of finite automata on guarded ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010